Reliable Logic Circuits with Byte Error Control Codes: A Feasibility Study
نویسندگان
چکیده
This paper addresses the relations between logic circuit synthesis, error model and error control codes so that the eecient reliable logic circuits can be obtained. We propose that single fault masking capability of a random logic circuit can be obtained by encoding its outputs in a byte error correcting code; this is equivalent to that of the triple modulo redundancy (TMR) technique. Similarly, byte error detecting code can be used to provide an equivalence of duplication. In this paper, we address the problems and issues related to the realization of byte-organized connguration where the byte error control codes can be applied. Some MCNC benchmark circuits are used as examples to demonstrate the feasibility of the proposed concept.
منابع مشابه
Byte Reconfigurable LDPC Codec Design for High Performance Error Correction
-Error correction provides reliable information free from errors. BCH codes are widely used to perform error correction. However, in order to improve the reliability of error correction BCH codes have been replaced by Low Density Parity Check (LDPC) codes. LDPC codes are special class of error correcting codes widely used in communication and memory systems, due to its Shannon limit approaching...
متن کاملAutomatic Generation of Error Control Codes
| This paper proposes a methodology, implemented in a tool, to automatically generate the main classes of Error Control Codes (ECCs) widely applied in computer memory systems to increase reliability and data integrity. New code construction techniques extending the features of previous Single Error Correcting (SEC)-Double Error Detecting (DED)-Single Byte Error Detecting (SBD) codes have been i...
متن کاملMacWilliams Identity for m-spotty Weight Enumerators over Finite Ring ⋆
Recently, the m-spotty byte error control codes are used in computer memory systems to detect and correct errors. These codes are essential to make the memory systems more reliable. In this paper, we introduce the m-spotty weights and m-spotty weight enumerator of linear codes over the ring Fp[u]/(u s). Moreover, we prove a MacWilliams type identity for m-spotty weight enumerator.
متن کاملMacWilliams Type identities for $m$-spotty Rosenbloom-Tsfasman weight enumerators over finite commutative Frobenius rings
The m-spotty byte error control codes provide a good source for detecting and correcting errors in semiconductor memory systems using high density RAM chips with wide I/O data (e.g. 8, 16, or 32 bits). m-spotty byte error control codes are very suitable for burst correction. M. Özen and V. Siap [7] proved a MacWilliams identity for the m-spotty Rosenbloom-Tsfasman (shortly RT) weight enumerator...
متن کاملA Design Methodology for Reliable MRF-Based Logic Gates
Probabilistic-based methods have been used for designing noise tolerant circuits recently. In these methods, however, there is not any reliability mechanism that is essential for nanometer digital VLSI circuits. In this paper, we propose a novel method for designing reliable probabilistic-based logic gates. The advantage of the proposed method in comparison with previous probabilistic-based met...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996